Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

a(b(x)) → b(a(x))
a(c(x)) → x

Q is empty.


↳ QTRS
  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

a(b(x)) → b(a(x))
a(c(x)) → x

Q is empty.

We use [23] with the following order to prove termination.

Recursive path order with status [2].
Quasi-Precedence:
a1 > b1
c1 > b1

Status:
a1: [1]
b1: [1]
c1: multiset